SDE: A Novel Clustering Framework Based on Sparsity-Density Entropy
نویسندگان
چکیده
منابع مشابه
Entropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملA novel sparsity and clustering regularization
We propose a novel SPARsity and Clustering (SPARC) regularizer, which is a modified version of the previous octagonal shrinkage and clustering algorithm for regression (OSCAR), where, the proposed regularizer consists of a K-sparse constraint and a pair-wise l∞ norm restricted on the K largest components in magnitude. The proposed regularizer is able to separably enforce K-sparsity and encourag...
متن کاملA novel entropy-based hierarchical clustering framework for ultrafast protein structure search and alignment
Identification and alignment of threedimensional folding of proteins may yield useful information about relationships too remote to be detected by conventional methods, such as sequence comparison, and may potentially lead to prediction of patterns and motifs in mutual structural fragments. With the exponential increase of structural proteomics data, the methods that scale with the rate of incr...
متن کاملA General Framework for Density Based Time Series Clustering Exploiting a Novel Admissible Pruning Strategy
Time Series Clustering is an important subroutine in many higher-level data mining analyses, including data editing for classifiers, summarization, and outlier detection. It is well known that for similarity search the superiority of Dynamic Time Warping (DTW) over Euclidean distance gradually diminishes as we consider ever larger datasets. However, as we shall show, the same is not true for cl...
متن کاملMinimum Conditional Entropy Clustering: A Discriminative Framework for Clustering
In this paper, we introduce an assumption which makes it possible to extend the learning ability of discriminative model to unsupervised setting. We propose an informationtheoretic framework as an implementation of the low-density separation assumption. The proposed framework provides a unified perspective of Maximum Margin Clustering (MMC), Discriminative k -means, Spectral Clustering and Unsu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2018
ISSN: 1041-4347
DOI: 10.1109/tkde.2018.2792021